Parameterized Learnability of k -Juntas and Related Problems
نویسندگان
چکیده
We study the parameterized complexity of learning k-juntas and some variations of juntas. We show the hardness of learning k-juntas and subclasses of k-juntas in the PAC model by reductions from a W[2]complete problem. On the other hand, as a consequence of a more general result we show that k-juntas are exactly learnable with improper equivalence queries and access to a W[P] oracle. Subject Classification: Learning theory, computational complexity.
منابع مشابه
Count-mass Distinction in the Acquisition of English Articles by Persian Learners of English
Articles in general and definite articles in particular can create problems even long after all other aspects of English have been mastered. The present article investigated the learnability problems related to the acquisition of count-mass distinction of English nominals by Persian L2 learners. The theoretical underpinning of the study is the interpretability hypothesis (Tsimpli & Dimitrakopou...
متن کاملNew Results for Random Walk Learning
In a very strong positive result for passive learning algorithms, Bshouty et al. showed that DNF expressions are efficiently learnable in the uniform random walk model. It is natural to ask whether the more expressive class of thresholds of parities (TOP) can also be learned efficiently in this model, since both DNF and TOP are efficiently uniform-learnable from queries. However, the time bound...
متن کاملFinding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in the technical sense of identifiability in the limit from positive data. They are defined in terms of bounds on certain parameters of the grammars. Intuitively, these bounds correspond to restrictions on linguistic aspects such as...
متن کامل2 Learning Monotone Boolean Functions
Last time we finished the discussion about KM algorithm and its application. We also covered sparse Fourier representations and k-juntas of parities. In the end we started to talk about learning monotone Boolean functions and influence of such functions. Today We will first finish discussion about learning monotone Boolean functions. Then we will also talk about learning k-juntas of halfspaces....
متن کاملTesting Juntas (draft)
A function on n variables is called a k-junta if it depends on at most k of its variables. The problem of testing whether a function is a k-junta or is “far” from being a k-junta is a central problem in property testing and is closely related to the problem of learning high-dimensional data. In this note, we give an informal presentation of three recent algorithms for testing juntas efficiently.
متن کامل